Infinite stable graphs with large chromatic number

We prove that if $G=(V,E)$ is an $\omega$-stable (respectively, superstable) graph with $\chi (G)>\aleph _0$ $2^{\aleph _0}$) then $G$ contains all the finite subgraphs of shift $\mathrm {Sh}_n(\omega )$ for some $n$. a variant this theorem graphs interpretable in stationary stable theories. Furthermore, $\operatorname {U}(G)\leq 2$ we $n\leq suffices.